Convex Blind Deconvolution with Random Masks
نویسندگان
چکیده
We solve blind deconvolution problems where one signal is modulated by multiple random masks using nuclear norm minimization. Theoretical analysis shows the number of masks for successful recovery scales as poly-logarithm of the problem dimension. OCIS codes: 100.1455, 100.3190.
منابع مشابه
Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
In this paper we analyze the blind deconvolution of an image and an unknown blur in a coded imaging system. The measurements consist of subsampled convolution of an unknown blurring kernel with multiple random binary modulations (coded masks) of the image. To perform the deconvolution, we consider a standard lifting of the image and the blurring kernel that transforms the measurements into a se...
متن کاملBranchHull: Convex bilinear inversion from the entrywise product of signals with known signs
We consider the bilinear inverse problem of recovering two vectors, x and w, in R from their entrywise product. For the case where the vectors have known signs and belong to known subspaces, we introduce the convex program BranchHull, which is posed in the natural parameter space and does not require an approximate solution or initialization in order to be stated or solved. Under the structural...
متن کاملBlind Deconvolution via Lower-Bounded Logarithmic Image Priors
In this work we devise two novel algorithms for blind deconvolution based on a family of logarithmic image priors. In contrast to recent approaches, we consider a minimalistic formulation of the blind deconvolution problem where there are only two energy terms: a leastsquares term for the data fidelity and an image prior based on a lowerbounded logarithm of the norm of the image gradients. We s...
متن کاملA Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method
Recently, Kundur and Hatzinakos showed that a linear restoration filter designed by using the almost obvious a priori knowledge on the original image, such as (i) nonnegativity of the true image and (ii) the smallest rectangle encompassing the original object, can realize a remarkable performance for a blind image deconvolution problem. In this paper, we propose a new set-theoretic blind image ...
متن کاملA Robust Method for Blind Deconvolution of Barcode Signals and Nonuniform Illumination Estimation
This paper deals with a joint nonuniform illumination estimation and blind deconvolution for barcode signals. Such optimization problems are highly non convex. A robust method is needed in case of noisy and/or blurred signals and nonuniform illumination. Here, we present a novel method based on a genetic algorithm combining discrete and continuous optimization which is successfully applied to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014